/*
 * Problem:
 * Say you have an array for which the ith element is the price of a given stock on day i.
 * 假设有一个数组，它的第i个元素是一个给定的股票在第i天的价格。
 * Design an algorithm to find the maximum profit. 
 * 设计一个算法找到最大的利润。
 * You may complete as many transactions as you like (ie, buy one and sell one share of the stock multiple times). 
 * 你可以完成尽可能多的交易（多次买卖股票）
 * However, you may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).
 * 然而，你不能在同一时间参与多个交易（你必须在你再次购买前出售股票）
 * 给定一棵二叉树，找出它的最大深度
 * The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
 * 最大深度是从根节点向下到最远的叶节点所经过的最长路径的结点的数量。
 * 
 * Example:
 * Given an example [2,1,2,0,1], return 2
 * 
 */
package me.yobol.lintcode.medium.maxprofit;

/**
 *
 * @author Yobol
 */
public interface IMaxProfit {
    public int maxProfit(int[] prices);
}
